Atomic hash instruction

ABSTRACT

A method for performing a hash operation, including providing an atomic hash instruction that directs a microprocessor to perform a the hash operation and to indicate whether the hash operation has been interrupted by an interrupting event; translating the atomic hash instruction into first and second micro instructions; via a hash unit, first executing the first micro instructions to accomplish the hash operation according to the hash mode; and via an integer unit, second executing the second micro instructions in parallel with the first executing to test a bit in a flags register, to update text pointer registers, and to process interrupts during execution of the hash operation. The atomic hash instruction has an opcode field, configured to prescribe the hash operation, and a hash mode field, configured to prescribe that the microprocessor accomplish the hash operation according to a one of a plurality of hash modes.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of the following U.S. patentapplication, which is herein incorporated by reference for all intentsand purposes.

SERIAL FILING NUMBER DATE TITLE 10963427 Oct. 12, 2004 APPARATUS ANDMETHOD FOR (CNTR.2240) SECURE HASH ALGORITHM

U.S. patent application Ser. No. 10/963,427 claims the benefit of thefollowing U.S. Provisional Applications, which are each hereinincorporated by reference for all intents and purposes.

SERIAL FILING NUMBER DATE TITLE 60510803 Oct. 10, 2003 SECURE HASHALGORITHM (CNTR.2234) APPARATUS AND METHOD 60571123 May 14, 2004APPARATUS AND METHOD FOR (CNTR.2240) SECURE HASH ALGORITHM 60582423 Jun.24, 2004 SECURE HASH ALGORITHM (CNTR.2252) PROGRAMMING GUIDE 60582422Jun. 24, 2004 SECURITY APPLICATION NOTE (CNTR.2253) 60610481 Sep. 16,2004 VIA PROCESSORS (CNTR.2278)

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention relates in general to the field of microelectronics, andmore particularly to an apparatus and method for performing hashfunctions on one or more message blocks to generate a message digest.

2. Description of the Related Art

An early computer system operated independently of other computersystems in the sense that all of the input data required by anapplication program executing on the early computer system was eitherresident on that computer system or was provided by an applicationprogrammer at run time. The application program generated output data asa result of being executed and the output data was generally in the formof a paper printout or a file which was written to a magnetic tapedrive, disk drive, or other type of mass storage device that was part ofthe computer system. The output file could then be used as an input fileto a subsequent application program that was executed on the samecomputer system or, if the output data was previously stored as a fileto a removable or transportable mass storage device, it could then beprovided to a different, yet compatible, computer system to be employedby application programs thereon. On these early systems, the need forprotecting sensitive information was recognized and, among otherinformation security measures, message digest generation applicationprograms were developed and employed to protect the sensitiveinformation from unauthorized disclosure. These application programs arealso referred to as one-way hash functions, hash functions, compressionapplications, contraction functions, fingerprints, cryptographicchecksums, message integrity checksums, and manipulation detection code.By whatever name, these applications typically take a variable lengthinput string called a message or pre-image, and convert it to afixed-length and generally smaller size output string called a hash ormessage digest.

Message digest generation functions have been employed by applicationprograms in the information security area for many years and are used toverify the contents of a given string of data, or a file, or of manyfiles stored on, say, a hard disk or magnetic tape. For example,consider sending a file to a someone else over the Internet. If thatfile contains financial, contractual, legal, or any other type of datathat is important for both sender and receiver to know with highprobability that it hasn't been tampered with, then the sender wouldperform a hash of the file and would send the message digest to therecipient along with the file itself. If the file has been changed inany way during transmission, when the recipient performs the same hash(i.e., executes the same hash function as the sender performed) of thefile upon receipt, then the message digest generated upon receipt willnot match that which was sent and thus, it is known that the contents ofthe file have changed since they were sent. Of course, it is possiblefor the file to be attacked in such a manner as to change both themessage and the hash so that the altered hash matches the alteredmessage. In such a case, the attack would be successful. This is whyinformation security protocols utilize, in addition to message digestgeneration functions, other techniques to protect information such asencryption, secure authentication, and the like. A detailed discussionof these techniques, however, is beyond the scope of this application.

Hash functions are very useful because they are one-way functions. Nocryptographic key is required for their use and the output (“messagedigest” or “hash”) is not dependent upon the input (“message” or“pre-image”) in any discernable way. Bruce Schneier notes in his workApplied Cryptography: Protocols, Algorithms, and Source Code in C [1996.John Wiley & Sons: New York], that “[a] single bit change in thepre-image changes, on the average, half of the bits in the hash value.Given a hash value, it is computationally infeasible to find a pre-imagethat hashes to that value.”

With the advent of computer networks and more advanced data transmissionprotocols, the probability for unauthorized access of sensitive fileshas dramatically increased. In fact, today's network architectures,operating systems, and data transmission protocols have evolved to theextent that the ability to access shared data is not only supported, butis prominently featured. For example, it is commonplace today for a userof a computer workstation to access files on a different workstation ornetwork file server, or to utilize the Internet to obtain news and otherinformation, or to transmit and receive electronic messages (i.e.,email) to and from hundreds of other computers, or to connect with avendor's computer system and to provide credit card or bankinginformation in order to purchase products from that vendor, or toutilize a wireless network at a restaurant, airport, or other publicsetting to perform any of the aforementioned activities. Therefore, theneed to protect sensitive data and transmissions from unauthorizedtampering has grown dramatically. The number of instances during a givencomputer session where a user is obliged to validate or verify his orher sensitive data has substantially increased. Current news headlinesregularly bring computer information security issues such as spam,spyware, adware, hacking, identity theft, spoofing, and credit cardfraud to the forefront of public concern. And since the motivation forthese invasions of privacy range all the way from innocent mistakes topremeditated cyber terrorism, responsible agencies have responded withnew laws, stringent enforcement, and public education programs. Yet,none of these responses has proved to be effective at stemming the tideof computer information compromise. Consequently, what was once theexclusive concern of governments, financial institutions, the military,and spies has now become a significant issue for the average citizen whoreads their email or accesses their checking account transactions fromtheir home computer. On the business front, one skilled in the art willappreciate that corporations from small to large presently devote aremarkable portion of their resources to the validation and verificationof proprietary information.

Within the field of cryptography, several procedures and protocols havebeen developed that allow for users to perform hash operations withoutrequiring great knowledge or effort and for those users to be able totransmit or otherwise provide their information products in along with acorresponding message digest to different users. One skilled in the artwill appreciate that these procedures and protocols generally take theform mathematical algorithms which application programs specificallyimplement to accomplish a hash of sensitive information.

Several algorithms are currently used to perform digital hash functions.These include, but are not limited to, the Secure Hash Algorithm (SHA),N-Hash, Snerfu, MD2, MD4, MD5, Ripe-MD, Haval, and one-way hashfunctions that employ symmetric key or public-key algorithms such asCBC-MAC, which uses the Cipher Block Chaining mode of the AdvancedEncryption Standard (AES) as its hash function. As noted, there are anumber of hash functions which are readily available for use in thepublic sector, but only one of these algorithms—SHA—has seen extensiveuse. This is primarily because the U.S. Government has adopted SHA asthe standard hash algorithm for use across all U.S. government agencies.This standard hash algorithm is specified in the Federal InformationProcessing Standards Publication 180-2, dated Aug. 1, 2002, and entitledSecure Hash Standard, which is herein incorporated by reference for allintents and purposes. This standard is available from the U.S.Department of Commerce, National Institute of Standards and Technology,Washington, D.C. Currently, SHA comprises four hash modes: SHA-1,SHA-256, SHA-384, and SHA-512.

According to SHA, a message (i.e., “input text”) is divided into blocksof a specified size for purposes of performing a hash function. Forexample, a SHA-1 hash is performed on message blocks which are 512 bitsin size, using a 32-bit word size, and which generates a 160-bit messagedigest. A SHA-256 hash is performed on message blocks which are 512 bitsin size, using a 32-bit word size, and generates a 256-bit messagedigest. A SHA-384 hash is performed on message blocks which are 1024bits in size, using a 64-bit word size, and generates a 384-bit messagedigest. And a SHA-512 hash is performed on message blocks which are 1024bits in size, using a 64-bit word size, and generates a 512-bit messagedigest. In all cases, an initial hash value is set and is modified afterprocessing each message block. This modified hash value is known as anintermediate hash value. The value of the hash following processing ofthe last message block is the message digest.

All of the SHA modes utilize the same type of sub-operations to performhash of a message block such as bitwise logical word operations (AND,OR, NOT, Exclusive-OR), modulo addition, bit shift operations, bitrotate operations (i.e., circular shift). Different combinations ofthese operations are employed to generate the intermediate hash valuesaccording to the different SHA modes. Other hash algorithms utilizeslightly different sub-operations and combinations of sub-operations,yet the sub-operations themselves are substantially similar to those ofSHA because they are employed in a similar fashion to transform one ormore message blocks into a corresponding message digest.

One skilled in the art will appreciate that there are numerousapplication programs available for execution on a computer system thatcan perform hash operations, and a great number are available forperforming hashes according to SHA. In fact, some operating systems(e.g. MICROSOFT® WINDOWSXP®, LINUX®) provide direct message digestgeneration services in the form of hash primitives, hash applicationprogram interfaces, and the like. The present inventors, however, haveobserved that present day computer hash techniques are deficient inseveral respects. Thus, the reader's attention is directed to FIG. 1,whereby these deficiencies are highlighted and discussed below.

FIG. 1 is a block diagram 100 illustrating present day computer messagedigest applications. The block diagram 100 depicts a first computerworkstation 101 connected to a local area network 105. Also connected tothe network 105 is a second computer workstation 102, a network filestorage device 106, a first router 107 or other form of interface to awide area network (WAN) 110 such as the Internet, and a wireless networkrouter 108 such as one of those compliant with IEEE Standard 802.11. Alaptop computer 104 interfaces to the wireless router 108 over awireless network 109. At another point on the wide area network 110, asecond router 111 provides interface for a third computer workstation103.

As alluded to above, a present day user is confronted with the issue ofcomputer information security many times during a work session. Forexample, under the control of a present day multi-tasking operatingsystem, a user of workstation 101 can be performing several simultaneoustasks, each of which require hash operations. The user of workstation101 is required to run a hash application 112 (either provided as partof the operating system or invoked by the operating system) to generatea message digest for a local file which is then stored on the networkfile storage device 106. Concurrent with the file storage, the user cantransmit an file and corresponding message digest to a second user atworkstation 102, which also requires executing an instance of the hashapplication 112. In addition, the user can be accessing or providinghis/her financial data (e.g., credit card numbers, financialtransactions, etc.) or other forms of sensitive data over the WAN 110from workstation 103, which requires additional instances of the hashapplication 112. Workstation 103 could also represent a home office orother remote computer 103 that the user of workstation 101 employs whenout of the office to access any of the shared resources 101, 102, 106 onlocal area network 105. Each of these aforementioned activities requiresthat a corresponding instance of the hash application 112 be invoked.Furthermore, wireless networks 109 are now being routinely provided incoffee shops, airports, schools, and other public venues, thus promptinga need for a user of laptop 104 to hash not only his/her files (or otherforms of data) to/from other users, but to employ hash functions fordata that is transmitted over the wireless network 109 to the wirelessrouter 108.

One skilled in the art will therefore appreciate that along with eachactivity that requires hash operations at a given workstation 101-104,there is a corresponding requirement to invoke an instance of the hashapplication 112. Hence, a computer 101-104 in the near future couldpotentially be performing hundreds of concurrent hash operations.

The present inventors have noted several limitations to the aboveapproach of performing hash operations by invoking one or more instancesof a hash application 112 on a computing system 101-104. For example,performing a prescribed function via programmed software is exceedinglyslow compared to performing that same function via dedicated hardware.Each time the hash application 112 is required, a current task executingon a computer 101-104 must be suspended from execution, and parametersof the hash operation (i.e., message, hash algorithm, hash mode, etc.)must be passed through the operating system to the instance of the hashapplication 112, which is invoked for accomplishment of the hashoperation. And because hash algorithms necessarily involve the executionof numerous of sub-operations on a particular block of data (i.e.,message block), execution of the hash applications 112 involves theexecution of numerous computer instructions to the extent that overallsystem processing speed is disadvantageously affected.

In addition, current techniques are limited because of the delaysassociated with operating system intervention. Most application programsdo not provide integral message digest generation components; theyemploy components of the operating system or plug-in applications toaccomplish these tasks. And operating systems are otherwise distractedby interrupts and the demands of other currently executing applicationprograms.

Furthermore, the present inventors have noted that the accomplishment ofhash operations on a present day computer system 101-104 is very muchanalogous to the accomplishment of floating point mathematicaloperations prior to the advent of dedicated floating point units withinmicroprocessors. Early floating point operations were performed viasoftware and hence, they executed very slowly. Like floating pointoperations, hash operations performed via software are disagreeablyslow. As floating point technology evolved further, floating pointinstructions were provided for execution on floating pointco-processors. These floating point co-processors executed floatingpoint operations much faster than software implementations, yet theyadded cost to a system. Likewise, message digest co-processors or coresexist today in the form of add-on boards or external devices thatinterface to a host processor via parallel ports or other interfacebuses (e.g., USB). These co-processors certainly enable theaccomplishment of hash operations much faster than pure softwareimplementations. But hash co-processors add cost to a systemconfiguration, require extra power, and decrease the overall reliabilityof a system. In addition, hash co-processor implementations arevulnerable to snooping because the data channel is not on the same dieas the host microprocessor.

Therefore, the present inventors recognize a need for dedicated hashhardware within a present day microprocessor such that an applicationprogram that requires a hash operation can direct the microprocessor toperform the hash operation via a single, atomic, hash instruction. Thepresent inventors also recognize that such a capability should beprovided so as to preclude requirements for operating systemintervention and management. Also, it is desirable that the hashinstruction be available for use at an application program's privilegelevel and that the dedicated hash hardware comport with prevailingarchitectures of present day microprocessors. There is also a need toprovide the hash hardware and associated hash instruction in a mannerthat supports compatibility with legacy operating systems andapplications. It is moreover desirable to provide an apparatus andmethod for performing hash operations that are resistant to unauthorizedobservation, that can support and are programmable with respect tomultiple hash algorithms, that support verification and testing of theparticular hash algorithm that is embodied thereon, that areself-padding, that support multiple message block sizes, and thatprovide for programmable hash algorithm mode such as SHA-1, SHA-256,SHA-384, and SHA-512, for example.

SUMMARY OF THE INVENTION

The present invention, among other applications, is directed to solvingthe above-noted problems and addresses other problems, disadvantages,and limitations of the prior art. The present invention provides asuperior technique for rapidly performing digital hash applications in acomputing environment. In one embodiment, an apparatus configured toperform a hash operation is provided. The apparatus includes an atomichash instruction, disposed within a microprocessor, that is configuredto direct the microprocessor to perform the hash operation, where thehash operation is accomplished on one or more message blocks, and wherethe microprocessor translates the atomic hash instruction into firstmicro instructions and second micro instructions. The atomic hashinstruction has an opcode field and a hash mode field. The opcode fieldis configured to prescribe that the microprocessor accomplish the hashoperation and indicate whether the hash operation has been interruptedby an interrupting event. The hash mode field is coupled to the opcodefield and is configured to prescribe that the microprocessor accomplishthe hash operation according to a prescribed hash mode. Themicroprocessor includes an integer unit, configured to operate inparallel with a hash unit, where the hash unit executes the first microinstructions to perform a hash of one or more message blocks, and wherethe integer unit executes the second micro instructions to test a bit ina flags register, to update text pointer registers, and to processinterrupts during execution of the hash operation.

One aspect of the present invention contemplates an apparatus forperforming a hash operation. The apparatus includes an x86-compatiblemicroprocessor, configured to perform the hash operation, and configuredto indicate whether the hash operation has been interrupted by aninterrupting event, where the hash operation is accomplished on one ormore message blocks. The x86-compatible microprocessor has a translatorand an integer unit. The translator is configured to translate an atomichash instruction into first micro instructions and second microinstructions. The atomic hash instruction includes an opcode field,configured to prescribe the hash operation, and a hash mode field,coupled to the opcode field, configured to prescribe that themicroprocessor accomplish the hash operation according to a one of aplurality of hash mode. The integer unit is configured to operate inparallel with a hash unit, where the hash unit executes the first microinstructions to perform a hash of the one or more message blocks, andwhere the integer unit executes the second micro instructions to test abit in a flags register, to update text pointer registers, and toprocess interrupts during execution of the hash operation.

Another aspect of the present invention comprehends a method forperforming a hash operation in a microprocessor. The method includesproviding an atomic hash instruction that directs the microprocessor toperform a the hash operation on one or more message blocks and toindicate whether the hash operation has been interrupted by aninterrupting event, where the atomic hash instruction comprises: anopcode field, configured to prescribe the hash operation; and a hashmode field, coupled to the opcode field, configured to prescribe thatthe microprocessor accomplish the hash operation according to a one of aplurality of hash modes; translating the single, atomic hash instructioninto first micro instructions and second micro instructions; via a hashunit disposed within the microprocessor, first executing the first microinstructions to accomplish the hash operation according to the hashmode; and via an integer unit disposed within the microprocessor, secondexecuting the second micro instructions in parallel with the firstexecuting to test a bit in a flags register, to update text pointerregisters, and to process interrupts during execution of the hashoperation.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other objects, features, and advantages of the presentinvention will become better understood with regard to the followingdescription, and accompanying drawings where:

FIG. 1 is a block diagram illustrating present day message digestapplications;

FIG. 2 is a block diagram depicting a conventional technique forperforming hash operations;

FIG. 3 is a block diagram featuring a microprocessor apparatus accordingto the present invention for performing hash operations;

FIG. 4 is a block diagram showing one embodiment of an atomic hashinstruction according to the present invention;

FIG. 5 is a table illustrating exemplary opcode field values accordingto the atomic hash instruction of FIG. 4;

FIG. 6 is a block diagram detailing a hash unit within an x86-compatiblemicroprocessor according to the present invention;

FIG. 7 is a diagram illustrating fields within an exemplary microinstruction for directing hash sub-operations within the microprocessorof FIG. 6;

FIG. 8 is a table depicting values of the register field for an XLOADmicro instruction according to the format of FIG. 7;

FIG. 9 is a table showing values of the register field for an XSTORmicro instruction according to the format of FIG. 7;

FIG. 10 is diagram highlighting an exemplary hash unit control wordformat for prescribing a hash algorithm for accomplishment of a hashoperation according to the present invention;

FIG. 11 is a table depicting values of the MODE field for the controlword of FIG. 10;

FIG. 12 is a block diagram featuring details of an exemplary hash unitaccording to the present invention; and

FIG. 13 is a block diagram illustrating an embodiment of block hashlogic according to the present invention for performing hash operationsin accordance with hash algorithms specified in the Secure HashStandard;

DETAILED DESCRIPTION

The following description is presented to enable one of ordinary skillin the art to make and use the present invention as provided within thecontext of a particular application and its requirements. Variousmodifications to the preferred embodiment will, however, be apparent toone skilled in the art, and the general principles defined herein may beapplied to other embodiments. Therefore, the present invention is notintended to be limited to the particular embodiments shown and describedherein, but is to be accorded the widest scope consistent with theprinciples and novel features herein disclosed.

In view of the above background discussion on hash operations andassociated techniques employed within present day computer systems togenerate a hash, or message digest that corresponds to a message thatconsists of one or more message blocks, the discussion of thesetechniques and their limitations will now be continued with reference toFIG. 2. Following this, the present invention will be discussed withreference to FIGS. 3-13. The present invention provides an apparatus andmethod for performing hash operations in a present day computingenvironment that exhibits superior performance characteristics overprevailing mechanisms and furthermore satisfies the above noted goals oflimiting operating system intervention, atomicity, legacy andarchitectural compatibility, algorithmic and mode programmability,self-preprocessing (i.e., padding) of messages, hack resistance, andtestability.

Now turning to FIG. 2, a block diagram 200 is presented depictingtechniques for performing hash operations in a present day computersystem as discussed above. The block diagram 200 includes amicroprocessor 201 that fetches instructions and accesses dataassociated with an application program from system memory 203. Programcontrol and access of data within the system memory 203 is generallymanaged by operating system software 202 that resides in a protectedarea of the system memory 203. As discussed above, if an executingapplication program (e.g., an email program or a file storage program)requires that a hash operation be performed, the executing applicationprogram must accomplish the hash operation by directing themicroprocessor 201 to execute a significant number of instructions.These instructions may be subroutines that are part of the executingapplication program itself, they may be plug-in applications that arelinked to the execution application program, or they may be servicesthat are provided by the operating system 202. Regardless of theirassociation, one skilled in the art will appreciate that theinstructions will reside in some designated or allocated area of memory203. For purposes of discussion, these areas of memory are shown withinthe system memory 203 and comprise a hash application 204 that typicallyissues a long sequence of instructions to the microprocessor 201 toretrieve a message 207 from the system memory 203, to execute aspecified hash algorithm, to generate a message digest 208, and to storethe message digest 208 back to memory 203. Following generation of themessage digest, if a message is to be “signed,”, then a digitalsignature algorithm (DSA) sign application 205 is executed by themicroprocessor 201 to perform the functions that are required togenerate a verifiable digital signature. If a “received” message is tobe “verified,”, then a digital signature algorithm (DSA) verifyapplication 206 is executed by the microprocessor 206 to perform thefunctions that are required to verify a received digital signature.Other application programs may be substituted for the sign and verifyapplications 205, 206 as are appropriate for the particular task at handwhich requires hashing of a message 207.

It is noteworthy that a significant number of instructions must beexecuted in order to generate a message digest 208 that corresponds to aparticular message 207. The aforementioned Secure Hash Standard includesmany examples which allow the approximate number of instructions thatare required to be estimated. Consequently, one skilled in the art willappreciate that hundreds of instructions are required to accomplish asimple hash of a block of data. And each of these instructions must beexecuted by the microprocessor 201 in order to accomplish the requestedhash operation. Furthermore, the execution of instructions to perform ahash operation is generally seen as superfluous to the primary purposes(e.g., file management, instant messaging, email, remote file access,credit card transaction) of a currently executing application program.Consequently, a user of the currently executing application programsenses that the currently executing application is performinginefficiently. In the case of stand-alone or plug-in sign/verifyapplications 206, 207, invocation and management of these applications206, 207 must also be subject to the other demands of the operatingsystem 202 such as supporting interrupts, exceptions, and like eventsthat further exacerbate the problem. Moreover, it is often true that forevery concurrent hash operation that is required on a computer system, aseparate instance of the applications 204, 205, 206 must be allocated inmemory 203. One skilled in the art will appreciate that multiple hashescan be performed without having to allocate separate instances of thehash algorithm. A shared library (e.g., dynamic link library) techniquecan be employed by all applications that require a hash function,however such shared techniques require that security of individualprogram threads be maintained in some manner. In either case, as notedabove, it is anticipated that the number of concurrent hash operationsrequired to be performed by a microprocessor 201 will continue toincrease with time.

The present inventors have noted the problems and limitations of currentcomputer system hash techniques and furthermore recognize a need toprovide apparatus and methods for performing hash operations in amicroprocessor which do not exhibit disadvantageous program delays tousers. Accordingly, the present invention provides an apparatus andassociated methodology for performing hash operations via a dedicatedhash unit within a programmable device. The hash unit is activated toperform hash operations via programming of a single, atomic hashinstruction. The present invention will now be discussed with referenceto FIGS. 3-16.

Referring to FIG. 3, a block diagram 300 is provided featuring amicroprocessor apparatus according to the present invention forperforming hash operations. The block diagram 300 depicts amicroprocessor 301 that is coupled to a system memory 321 via a memorybus 319. The microprocessor 301 includes translation logic 303 thatreceives instructions from an instruction register 302. The translationlogic 303 comprises logic, circuits, devices, or microcode (i.e., microinstructions or native instructions), or a combination of logic,circuits, devices, or microcode, or equivalent elements that areemployed to translate instructions into associated sequences of microinstructions. The elements employed to perform translation within thetranslation logic 303 may be shared with other circuits, microcode,etc., that are employed to perform other functions within themicroprocessor 301. According to the scope of the present application,microcode is a term employed to refer to one or more micro instructions.A micro instruction (also referred to as a native instruction) is aninstruction at the level that a unit executes. For example, microinstructions are directly executed by a reduced instruction set computer(RISC) microprocessor. For a complex instruction set computer (CISC)microprocessor such as an x86-compatible microprocessor, x86instructions are translated into associated micro instructions, and theassociated micro instructions are directly executed by a unit or unitswithin the CISC microprocessor. The translation logic 303 is coupled toa micro instruction queue 304. The micro instruction queue 304 has aplurality of micro instruction entries 305, 306. The micro instructions305, 306 are provided from the micro instruction queue 304 to registerstage logic that includes a register file 307. The register file 307 hasa plurality of registers 311-313 whose contents are established prior toperforming a prescribed hash operation. Registers 311-312 point tocorresponding locations 326-327 in system memory 321: Location 326contains a message which is to be hashed by the prescribed hashoperation and location 327 contains an initial message digest value(“initial hash value). The register stage is coupled to load logic 314,which interfaces to a data cache 315 for retrieval of data forperformance of the prescribed hash operation. The data cache 315 iscoupled to the memory 321 via the memory bus 319. Execution logic 328 iscoupled to the load logic 314 and executes the operations prescribed bymicro instructions as passed down from previous stages. The executionlogic 328 comprises logic, circuits, devices, or microcode (i.e., microinstructions or native instructions), or a combination of logic,circuits, devices, or microcode, or equivalent elements that areemployed to perform operations as prescribed by instructions providedthereto. The elements employed to perform the operations within theexecution logic 328 may be shared with other circuits, microcode, etc.,that are employed to perform other functions within the microprocessor301. The execution logic 328 includes a hash unit 316. The hash unit 316receives data required to perform the prescribed hash operation from theload logic 314. Micro instructions direct the hash unit 316 to performthe prescribed hash operation on one or more blocks of the message 326to generate a corresponding message digest 327. The hash unit 316comprises logic, circuits, devices, or microcode (i.e., microinstructions or native instructions), or a combination of logic,circuits, devices, or microcode, or equivalent elements that areemployed to perform hash operations. The elements employed to performthe hash operations within the hash unit 316 may be shared with othercircuits, microcode, etc., that are employed to perform other functionswithin the microprocessor 301. In one embodiment, the hash unit 316operates in parallel to other execution units (not shown) within theexecution logic 328 such as an integer unit, floating point unit, etc.One embodiment of a “unit” within the scope of the present applicationcomprises logic, circuits, devices, or microcode (i.e., microinstructions or native instructions), or a combination of logic,circuits, devices, or microcode, or equivalent elements that areemployed to perform specified functions or specified operations. Theelements employed to perform the specified functions or specifiedoperations within a particular unit may be shared with other circuits,microcode, etc., that are employed to perform other functions oroperations within the microprocessor 301. For example, in oneembodiment, an integer unit comprises logic, circuits, devices, ormicrocode (i.e., micro instructions or native instructions), or acombination of logic, circuits, devices, or microcode, or equivalentelements that are employed to execute integer instructions. A floatingpoint unit comprises logic, circuits, devices, or microcode (i.e., microinstructions or native instructions), or a combination of logic,circuits, devices, or microcode, or equivalent elements that areemployed to execute floating point instructions. The elements employedexecute integer instructions within the integer unit may be shared withother circuits, microcode, etc., that are employed to execute floatingpoint instructions within the floating point unit. In one embodimentthat is compatible with the x86 architecture, the hash unit 316 operatesin parallel with an x86 integer unit, an x86 floating point unit, an x86MMX® unit, and an x86 SSE® unit. According to the scope of the presentapplication, an embodiment is compatible with the x86 architecture ifthe embodiment can correctly execute a majority of the applicationprograms that are designed to be executed on an x86 microprocessor. Anapplication program is correctly executed if its expected results areobtained. Alternative x86-compatible embodiments contemplate the hashunit 316 operating in parallel with a subset of the aforementioned x86execution units. The hash unit 316 is coupled to store logic 317 andprovides the corresponding message digest 327. The store logic 317 isalso coupled to the data cache 315, which routes the message digest data327 to system memory 321 for storage. The store logic 317 is coupled towrite back logic 318. The write back logic 318 updates registers 311-313within the register file 307 as the prescribed hash operation isaccomplished. In one embodiment, micro instructions flow through each ofthe aforementioned logic stages 302, 303, 304, 307, 314, 328, 317, 318in synchronization with a clock signal (not shown) so that operationscan be concurrently executed in a manner substantially similar tooperations performed on an assembly line.

Within the system memory 321, an application program that requires theprescribed hash operation can direct the microprocessor 301 to performthe operation via a single hash instruction 322, referred to herein forinstructive purposes as an XSHA instruction 322. In a CISC embodiment,the XSHA instruction 322 comprises an instruction that prescribes a hashoperation. In a RISC embodiment, the XSHA instruction 322 comprises amicro instruction that prescribes a hash operation. In one embodiment,the XSHA instruction 322 utilizes a spare or otherwise unusedinstruction opcode within an existing instruction set architecture. Inone x86-compatible embodiment, the XSHA instruction 322 is a 4-byteinstruction comprising an x86 REP prefix (i.e., 0xF3), followed byunused x86 2-byte opcode (e.g., 0x0FA6), followed by a 1-byte field thatprescribing a particular hash mode. In one embodiment, the XSHAinstruction 322 according to the present invention can be executed atthe level of system privileges afforded to application programs and canthus be programmed into a program flow of instructions that are providedto the microprocessor 301 either directly by an application program orunder control of an operating system 320. Since there is only oneinstruction 322 that is required to direct the microprocessor 301 toperform the prescribed hash operation, it is contemplated thataccomplishment of the operation is entirely transparent to the operatingsystem 320.

In operation, the operating system 320 invokes an application program toexecute on the microprocessor 301. As part of the flow of instructionsduring execution of the application program, an XSHA instruction 322 isprovided from memory 321 to the fetch logic 302. Prior to execution ofthe XSHA instruction 322, however, instructions within the program flowdirect the microprocessor 301 to initialize the contents of registers311-313 so that they point to locations 326-327 in memory 321 thatcontain input text 326 for the operation, and an initial hash value 327and so that the number of bytes in the message 326 is provided inregister 313. It is required to initialize registers 311-313 prior toexecuting the XSHA instruction 322 because the XSHA instruction 322implicitly references the registers 311-312 along with register 313 thatcontains the byte count. Although one embodiment contemplatesinitialization of the byte count in register 313, other embodiments arecontemplated as well such as storage of bit count, number of messageblocks in the message 326, etc. Thus, the translation logic 303retrieves the XSHA instruction from the fetch logic 302 and translatesit into a corresponding sequence of micro instructions that directs themicroprocessor 301 to perform the prescribed hash operation. A firstplurality of micro instructions 305-306 within the correspondingsequence of micro instructions specifically directs the hash unit 316 toload a message block provided from the load logic 314 and to beginexecution of a number of hash computations (as prescribed by theparticular hash mode) to generate a corresponding intermediate hashvalue and to provide the corresponding intermediate hash value to thestore logic 317 for storage in the message digest area 327 of memory 321via the data cache 315. A second plurality of micro instructions (notshown) within the corresponding sequence of micro instructions directsother execution units (not shown) within the microprocessor 301 toperform other operations necessary to accomplish the prescribed hashoperation such as management of non-architectural registers (not shown)that contain temporary results and counters, update of input and outputpointer registers, processing of pending interrupts, etc. In oneembodiment, registers 311-313 are architectural registers. Anarchitectural register 311-313 is a register that is defined within theinstruction set architecture (ISA) for the particular microprocessor 301that is implemented.

In one embodiment, the hash unit 316 is divided into a plurality ofstages thus allowing for pipelining of successive message blocks 326.

The block diagram 300 of FIG. 3 is provided to teach the necessaryelements of the present invention and thus, much of the logic within apresent day microprocessor 301 has been omitted from the block diagram300 for clarity purposes. One skilled in the art will appreciate,however, that a present day microprocessor 301 comprises many stages andlogic elements according to specific implementation, some of which havebeen aggregated herein for clarity purposes. For instance, the loadlogic 314 could embody an address generation stage followed by a cacheinterface stage, following by a cache line alignment stage. What isimportant to note, however, is that a complete hash operation on amessage 326 is directed according to the present invention via a singleinstruction 322 whose operation is otherwise transparent toconsiderations of the operating system 320 and whose execution isaccomplished via a dedicated hash unit 316 that operates in parallelwith and in concert with other execution units within the microprocessor301. The present inventors contemplate provision of alternativeembodiments of the hash unit 316 in embodiment configurations that areanalogous to provision of dedicated floating point unit hardware withina microprocessor in former years. Operation of the hash unit 316 andassociated XSHA instruction 322 is entirely compatible with theconcurrent operation of legacy operating systems 320 and applications,as will be described in more detail below.

Now referring to FIG. 4, a block diagram is provided showing oneembodiment of an atomic hash instruction 400 according to the presentinvention. The hash instruction 400 includes an optional prefix field401, which is followed by a repeat prefix field 402, which is followedby an opcode field 403, which is followed by a hash mode field 404. Inone embodiment, contents of the fields 401-404 comport with the x86instruction set architecture. Alternative embodiments contemplatecompatibility with other instruction set architectures. In a SHAembodiment, the hash instruction 400 prescribes execution of a hashoperation according to the Secure Hash Standard as noted above.Alternative embodiments contemplate prescription of a hash operationaccording to other hash algorithms to include N-Hash, Snerfu, MD2, MD4,MD5, Ripe-MD, Haval, and one-way hash functions that employ symmetrickey or public-key algorithms such as CBC-MAC, which uses the CipherBlock Chaining mode of the Advanced Encryption Standard (AES) as itshash function.

Operationally, the optional prefix 401 is employed in many instructionset architectures to enable or disable certain processing features of ahost microprocessor such as directing 16-bit or 32-bit operations,directing processing or access to specific memory segments, etc. Therepeat prefix 402 indicates that the hash operation prescribed by thehash instruction 400 is to be accomplished on one or more blocks of amessage. The repeat prefix 402 also implicitly directs a comportingmicroprocessor to employ the contents of a plurality of registerstherein as pointers to locations in system memory that contain hash dataand parameters needed to accomplish the specified hash operation. Asnoted above, in an x86-compatible embodiment, the value of the repeatprefix 402 is 0xF3. And, according to x86 architectural protocol, thehash instruction is very similar in form to an x86 repeat stringinstruction such as REP.MOVS. For example, when executed by anx86-compatible microprocessor embodiment of the present invention, therepeat prefix implicitly references a block count variable that isstored in architectural register ECX, a source address pointer (pointingto the message for the cryptographic operation) that is stored inregister ESI, and a destination address pointer (pointing to the messagedigest area in memory) that is stored in register EDI.

The opcode field 403 prescribes that the microprocessor accomplish ahash operation. The present invention contemplates preferred choice ofthe opcode value 403 as one of the spare or unused opcode values withinan existing instruction set architecture so as to preserve compatibilitywithin a conforming microprocessor with legacy operating system andapplication software. For example, as noted above, an x86-compatibleembodiment of the opcode field 403 employs value 0x0FA6 to directexecution of the specified hash operation.

The hash mode field 404 prescribes that the microprocessor accomplishthe specified hash operation (e.g., SHA) according to a prescribed hashmode (e.g., SHA-1, SHA-256, etc.) as will now be described withreference to FIG. 5.

FIG. 5 is a table 500 illustrating exemplary hash mode field valuesaccording to the atomic hash instruction of FIG. 4. Value 0xC8prescribes that the hash operation be accomplished according to theSHA-1 mode. Value 0xD0 prescribes that the hash operation beaccomplished according to the SHA-256 mode. Value 0xE0 prescribes thatthe hash operation be accomplished according to the SHA-384 mode. Andvalue 0xE8 prescribes that the hash operation be accomplished accordingto the SHA-512 mode. The noted modes are described in the aforementionedSecure Hash Standard.

Now turning to FIG. 6, a block diagram is presented detailing a hashunit 617 within an x86-compatible microprocessor 600 according to thepresent invention. The microprocessor 600 includes fetch logic 601 thatfetches instructions from memory (not shown) for execution. The fetchlogic 601 is coupled to translation logic 602. The translation logic 602comprises logic, circuits, devices, or microcode (i.e., microinstructions or native instructions), or a combination of logic,circuits, devices, or microcode, or equivalent elements that areemployed to translate instructions into associated sequences of microinstructions. The elements employed to perform translation within thetranslation logic 602 may be shared with other circuits, microcode,etc., that are employed to perform other functions within themicroprocessor 600. The translation logic 602 includes hash logic 640that is coupled to a translator 603 and a microcode ROM 604. Interruptlogic 633 couples to the translation logic 602 via bus 634. A pluralityof software and hardware interrupt signals 635 are processed by theinterrupt logic 633 which indicates pending interrupts to thetranslation logic 602 over the interrupt bus 634. The translation logic602 is coupled to successive stages of the microprocessor 600 includinga register stage 605, address stage 606, load stage 607, execute stage608, store stage 618, and write back stage 619. Each of the successivestages include logic to accomplish particular functions related to theexecution of instructions that are provided by the fetch logic 601 ashas been previously discussed with reference like-named elements in themicroprocessor of FIG. 3. The exemplary x86-compatible embodiment 600depicted in FIG. 6 features execution logic 632 within the execute stage608 that includes parallel execution units 610, 612, 614, 616, 617. Aninteger unit 610 receives integer micro instructions for execution frommicro instruction queue 609. A floating point unit 612 receives floatingpoint micro instructions for execution from micro instruction queue 611.An MMX® unit 614 receives MMX micro instructions for execution frommicro instruction queue 613. An SSE® unit 616 receives SSE microinstructions for execution from micro instruction queue 615. In theexemplary x86 embodiment shown, a hash unit 617 is coupled to the SSEunit 616 via a load bus 620, a stall signal 621, and a store bus 622.The hash unit 617 shares the SSE unit's micro instruction queue 615. Analternative embodiment contemplates stand-alone parallel operation ofthe hash unit 617 in a manner like that of units 610, 612, and 614. Theinteger unit 610 is coupled to a hash control register 626 to access amode field 625 which is set to indicate a prescribed hash mode and whichis accessed by the hash unit 617 to determine how to hash a message. Theinteger unit 610 is also coupled to a machine specific register 628 toevaluate the state of an E bit 629. The state of the E bit 629 indicateswhether or not the hash unit 617 is present within the microprocessor600. The integer unit 610 also accesses a D bit 631 in a feature controlregister 630 to enable or disable the hash unit 617. As with themicroprocessor embodiment 301 of FIG. 3, the microprocessor 600 of FIG.6 features elements essential to teach the present invention in thecontext of an x86-compatible embodiment and for clarity aggregates oromits other elements of the microprocessor 600. One skilled in the artwill appreciate that other elements are required to complete theinterface such as a data cache (not shown), bus interface unit (notshown), clock generation and distribution logic (not shown), etc.

In operation, instructions are fetched from memory (not shown) by thefetch logic 601 and are provided in synchronization with a clock signal(not shown) to the translation logic 602. The translation logic 602translates each instruction into a corresponding sequence of microinstructions that are sequentially provided in synchronization with theclock signal to subsequent stages 605-608, 618, 619 of themicroprocessor 600. Each micro instruction within a sequence of microinstructions directs execution of a sub-operation that is required toaccomplish an overall operation that is prescribed by a correspondinginstruction such as generation of an address by the address stage 606,addition of two operands within the integer unit 610 which have beenretrieved from prescribed registers (not shown) within the registerstage 605, storage of a result generated by one of the execution units610, 612, 614, 616, 617 in memory by the store logic 618, etc. Dependingupon the instruction that is being translated, the translation logic 602will employ the translator 603 to directly generate the sequence ofmicro instructions, or it will fetch the sequence from the microcode ROM604, or it will employ the translator 603 to directly generate a portionof the sequence and fetch the remaining portion of the sequence from themicrocode ROM 604. The micro instructions proceed sequentially throughthe successive stages 605-608, 618, 619 of the microprocessor 600 insynchronization with the clock signal. As micro instructions reach theexecute stage 608, they are routed by the execution logic 632 along withtheir operands (retrieved from registers within the register stage 605,or generated by logic within the address stage 606, or retrieved from adata cache by the load logic 608) to a designated execution unit 610,612, 614, 616, 617 by placing the micro instructions in a correspondingmicro instruction queue 609, 611, 613, 615. The execution units 610,612, 614, 616, 617 execute the micro instructions and provide results tothe store stage 618. In one embodiment, the micro instructions includefields indicating whether or not they can be executed in parallel withother operations.

Responsive to fetching an XSHA instruction as described above, thetranslation logic 602 generates associated micro instructions thatdirect logic within subsequent stages 605-608, 618, 619 of themicroprocessor 600 to perform the prescribed hash operation. Theparticular construct of the associated micro instructions is determinedin part by the value of the hash mode field 404 within the XSHAinstruction 400. For example, if the value of the hash mode field 404specifies that a SHA-256 mode be employed during execution of aprescribed hash operation, then the hash logic 640 will construct theassociated sequence of micro instructions to direct the microprocessor600 to retrieve the message from the memory locations 326 pointed to bycontents of the message pointer register 311, to load the messageaccording to SHA-256 block sizes into the hash unit 617 as will befurther detailed below, and to employ SHA-256 sub-operations duringexecution of the prescribed hash operation to generate a 256-bit messagedigest.

Accordingly, a first plurality of the associated micro instructions arerouted directly to the hash unit 617 and direct the unit 617 to loadinitial hash value data provided over the load bus 620 and to load ablock of message data and begin execution of a number of hashcomputations to produce an intermediate hash value and to provide theintermediate hash value to the store bus 622 for storage in memory bythe store logic 618. A second plurality of the associated microinstructions are routed to other execution units 610, 612, 614, 616 toperform other sub-operations that are necessary to accomplish theprescribed hash operation such as testing of the E bit 629, enabling theD bit 631, setting the value of the mode field 625 to indicate whichhash mode is to be employed during execution of the hash operation,updating registers (e.g., count register, message pointer register,message digest pointer register) within the register stage 605,processing of interrupts 635 indicated by the interrupt logic 633 overthe interrupt bus 634, padding of messages, etc. The associated microinstructions are ordered to provide for optimum performance of specifiedhash operations on multiple blocks of a message by interlacing integerunit micro instructions within sequences of hash unit micro instructionsso that integer operations can be accomplished in parallel with hashunit operations. Because the pointers to the message and message digest,and the byte count are provided within architectural registers, theirstates are saved when interrupts are processed and the states arerestored upon return from interrupts. When an interrupt is pending, thehash of the message block currently being processed is completed, theintermediate hash value is stored to memory, and the architecturalregisters are updated prior to allowing the interrupt to proceed. Uponreturn from the interrupt, the hash operation is repeated on theparticular block of input data that was being processed when theinterrupt occurred using the current value stored in the message digestlocation in memory, in substantial similarity to execution of the “REP”instructions particularly prevalent in the x86 instruction set. As each“rep” portion of the hash instruction is completed, its correspondingintermediate hash value is written to the message digest location inmemory.

Now referring to FIG. 7, a diagram is presented illustrating fieldswithin an exemplary micro instruction 700 for directing hashsub-operations within the microprocessor of FIG. 6. The microinstruction 700 includes a micro opcode field 701, a data register field702, a register field 703, and an other field 704. The micro opcodefield 701 specifies a particular sub-operation to be performed anddesignates logic within one or more stages of the microprocessor 600 toperform the sub-operation. Specific values of the micro opcode field 701designate that the micro instruction is directed for execution by a hashunit according to the present invention. In one embodiment, there aretwo specific values. A first value (XLOAD) designates that data is to beretrieved from a memory location whose address is specified by contentsof an architectural register denoted by contents of the data registerfield 702. The data is to be loaded into a register within the hash unitthat is specified by contents of the register field 703. The retrieveddata (e.g., message digest data or message block data) is provided tothe hash unit. A second value (XSTOR) of the micro opcode field 701designates that data generated by the hash unit is to be stored in amemory location whose address is specified by contents of anarchitectural register denoted by contents of the data register field702. In a multi-stage embodiment of the hash unit, contents of theregister field 703 prescribe one of a plurality of message digestlocations for storage in memory. The message digest data is provided bythe hash unit for access by store logic. The other field 704 specifiescontrol information that is beyond the scope of this application. Morespecific details concerning XLOAD and XSTOR micro instructions forexecution by a hash unit according to the present invention will now bediscussed with reference to FIGS. 8 and 9.

Turning to FIG. 8, a table 800 is presented depicting values of theregister field 703 for an XLOAD micro instruction according to theformat 700 of FIG. 7. As was previously discussed, a sequence of microinstructions is generated in response to translation of an XSHAinstruction. The sequence of micro instructions comprises a firstplurality of micro instructions that are directed for execution by thehash unit and a second plurality of micro instructions that are executedby one or more of the parallel functional units within themicroprocessor other that the hash unit. The second plurality of microinstructions direct sub-operations such as padding of messages; updatingof counters, temporary registers, and architectural registers; testingand setting of fields and status bits in machine specific or controlregisters, and so on. The first plurality of instructions provideinitial hash and message block data to the hash unit, and direct thehash unit to generate an intermediate hash value and to store theintermediate hash value to memory. An XLOAD micro instruction isprovided to the hash unit to load initial (or intermediate) hash valuedata or to load a portion of a message block and to begin execution ofthe prescribed hash operation. Value 0b100 in the register field 703 ofan XLOAD micro instruction directs the hash unit to load a portion of aninitial (or intermediate) hash value into its input-0 register. As thismicro instruction proceeds down the pipeline, an architectural messagedigest pointer register within the register stage is accessed to obtainthe address in memory where the message digest is stored. Address logictranslates the address into a physical address for a memory access. Theload logic fetches the portion of the message digest from cache andpasses it to the hash unit. Likewise, register field value 0b101 directsthe hash unit to load the remaining portion of the initial (orintermediate) hash value into its input-1 register. Value 0b010 directsthe hash unit to load a portion of a message block pointed to bycontents of the data register field 702 into its message register (MSG)and to begin execution of the prescribed hash operation according to themode indicated by the hash mode field in the hash control register.

All other values of the register field 703 in an XLOAD micro instructionare reserved.

Referring to FIG. 9, a table 900 is presented showing values of theregister field 703 for an XSTOR micro instruction according to theformat 700 of FIG. 7. An XSTOR micro instruction is issued to the hashunit to direct it to provide a generated hash value to store logic forstorage in memory at the address provided in the address field 702.Accordingly, translation logic according to the present invention issuesan XSTOR micro instruction for a particular hash value followingissuance of one or more XLOAD micro instructions for its correspondingmessage block. Value 0b100 of the register field 703 directs the hashunit to provide a portion of the hash value associated with its internaloutput-0 OUT-0 register to store logic for storage. Likewise, contentsof internal output-1 register, referenced by register field value 0b101,provide the remaining portion of the hash value. Accordingly, followingloading initial hash values, a plurality of message blocks can bepipelined through the hash unit by issuing hash micro instructions inthe order XLOAD.MSG, XLOAD.MSG, XLOAD.MSG, XLOAD.MSG, XSTOR.OUT-0,XSTOR.OUT-1, XLOAD.MSG, XLOAD.MSG, and so on.

Now turning to FIG. 10, a diagram is provided highlighting an exemplaryhash control register format 1000 for prescribing hash algorithm mode ofa hash operation according to the present invention. The controlregister 1000 contents are set according to the value of the hash modefield of an XSHA instruction, which is programmed by a user. Thecontents of the hash control register 1000 are set prior to performing ahash operation. Accordingly, as part of a sequence of micro instructionscorresponding to a provided XSHA instruction, an integer microinstruction is issued directing the microprocessor to set the value ofthe control register 1000. The control register 1000 includes a reservedRSVD field 1001 and a mode field 1002.

All values for the reserved field 1001 are reserved. Contents of themode field 1002 indicate a particular hash mode to be employed duringexecution of a prescribed hash operation, as will now be described withreference to FIG. 11.

Turning to FIG. 11, a table 1100 is presented illustrating exemplaryvalues of the mode field 1002 for the control register 1000 of FIG. 10.A “00” value of the mode field 1002 directs a computing device accordingto the present invention to perform a prescribed hash operationaccording to the SHA-1 algorithm mode. A “01” value of the mode field1002 directs a computing device according to the present invention toperform a prescribed hash operation according to the SHA-256 algorithmmode. A “10” value of the mode field 1002 directs a computing deviceaccording to the present invention to perform a prescribed hashoperation according to the SHA-384 algorithm mode. A “11” value of themode field 1002 directs a computing device according to the presentinvention to perform a prescribed hash operation according to theSHA-512 algorithm mode.

Now referring to FIG. 12, a block diagram is presented featuring detailsof an exemplary hash unit 1200 according to the present invention. Thehash unit 1200 includes a micro instruction register 1203 that receiveshash unit micro instructions (i.e., XLOAD and XSTOR micro instructions)1221-1223 via a micro instruction bus 1214. The hash unit 1200 alsoaccesses a hash control register 1204, and includes an input-0 register1205, and input-1 register 1206, and a message register 1207.Initial/intermediate hash values 1225-1226 along with message block data1227 are provided to registers 1205-1207 via a load bus 1211 asprescribed by contents of an XLOAD micro instruction within the microinstruction register 1203. The hash unit 1200 also includes block hashlogic 1201 that is coupled to all of the registers 1203-1207. The blockhash logic 1201 provides a stall signal 1213 and providesintermediate/final message digest values 1224 to an output-0 register1209 and an output-1 register 1210. The output registers 1209-1210 routethe intermediate/final hash values 1224 (i.e., message digest values) tosuccessive stages in a conforming microprocessor via a store bus 1212.In one embodiment, the micro instruction register 1203 and the hashcontrol register 1204 are 32 bits in size; and registers 1205-1207,1209-1210 are 128-bits in size. Alternative embodiments contemplate64-bit and 256-bit registers 1205-1207, 1209-1210 to optimize datathroughput according to the particular hash operation that is beingimplemented. The example of FIG. 12 depicts micro instructions 1221-1223and data 1224-1227 that is sized for execution of a SHA-1 hash function.These sizes are provided to clearly teach the present invention but itis noted that the bounds of the present invention are not to berestricted to such sizes, hash algorithms, or hash modes. As notedabove, the present invention comprehends any of the aforementioned hashalgorithms and modes.

Operationally, hash unit micro instructions are provided sequentially tothe micro instruction register 1203 along with data 1225-1227 that isdesignated for the input registers 1205-1206 and for the messageregister 1207. In the embodiment discussed with reference to FIGS. 8 and9, an initial hash value is loaded via XLOAD micro instructions 1221 tothe IN-0 and IN-1 registers 1205-1206. Following this, a first portionof a message block 1227 is loaded to the message register 1207. An XLOADmicro instruction to message register 1207 directs the hash unit to loadmessage data 1227 to the message register 1207 and to begin execution ofhash computations according to the hash mode provided via contents ofthe hash control register 1204. Upon receipt of an XLOAD microinstruction designating MSG 1207, the block hash logic 1201 startsperforming the hash operation prescribed by contents of the controlregister to generate an intermediate/final hash value 1224. Onceinitiated, the block hash logic 1201 continues executing the prescribedhash operation on supplied message data 1227 until the operation iscompleted. The hash unit 1200 performs a specified operation ondesignated portions 1227 of a message, either complete blocks orsub-blocks. Successive blocks of a message are hash through theexecution of corresponding successive XLOAD and XSTOR microinstructions. When an XSTOR micro instruction is executed, if theprescribed hash value 1224 (i.e., OUT-0 or OUT-1) has not yet completedgeneration, then the block hash logic 1201 asserts the stall signal1213. Once the hash value 1224 has been generated and placed into acorresponding output register 1209-1210, then the contents of thatregister 1209-1210 are transferred to the store bus 1212. Upongeneration of a final hash value 1224, the contents of the outputregisters 1209-1210 contain the completed message digest 1224 thatcorresponds to the complete message.

Now turning to FIG. 13, a block diagram is provided illustrating anexemplary embodiment of block hash logic 1300 according to the presentinvention for performing hash operations in accordance with the SecureHash Standard. The block hash logic 1300 includes a hash mode controller1301 that accesses a hash control register 1204 and that is coupled toword expansion logic 1303 and digest generation logic 1305 via a modebus 1302. The word expansion logic 1303 receives a portion of a messageblock from the message register 1207 and expands a message block intowords of a message schedule according to the specified SHA mode, whichare provided to word registers W79:W0 1304. One skilled will appreciatethat a SHA-1 message schedule employs all 80 word registers 1304,SHA-256 employs word registers W63:W0 1304 (i.e., only 64 words in aSHA-256 message schedule), and SHA-384 and SHA-512 message schedulesemploy all 80 word registers 1304. One skilled will also appreciate thatdifferent logical operations are executed on a message block to expand amessage schedule according to the SHA mode specified by the hash controlregister 1204. The word expansion logic 1303 comprises the logicrequired to perform the logical operations required for all implementedSHA modes and performs those operations as directed by the hash modecontroller 1301 via the mode bus 1302. Likewise, the block has logic1305 includes digest generation logic 1305 that receives the messageschedule from the word registers 1304 and that initializes workingvariable registers H:A 1306, that computes the contents of temporaryvariable registers TEMP 1307, T1 1308, and T2 1309, and that computescontents of intermediate/final hash value registers H7:H0 1310. As notedabove, registers H7:H0 1310 are initialized by XLOAD instructions toregisters IN-0 1205 and IN-1 1206. The contents of H7:H0 are provided toa store bus via execution of XSTOR instructions according to the presentinvention. Like the word expansion logic 1303, the digest generationlogic 1305 includes that logic required to implement all prescribed SHAhash modes, and executes only those sub-operations as directed by thehash mode controller 1301 via the mode bus 1302. For example, for aSHA-1 hash, only registers E:A 1306, TEMP 1307, and H4:H0 1310 areemployed as well as other logic therein as required to execute a SHA-1hash computation. Registers H:A 1306, T1 1308, T2 1309, and H7:H0 1310are employed for execution of SHA-256, SHA-384, and SHA-512 operations.And one skilled will appreciate that a SHA-384 hash employs the samelogical sub-functions as a SHA-512 hash, with the exception that adifferent initial hash values are loaded via IN-1 1206 and IN-0 1205,and that the final hash value in registers H7:H0 1310 is truncated toits leftmost 384 bits.

In the embodiment shown in FIG. 13, the block hash logic 1300 engine isdivided into two stages: a first stage between the message register MSG1207 and the word registers W79:W0 1304 and a second stage between theword registers 1304 and the output registers 1209-1210. Intermediatehash data is pipelined between these stages in synchronization with aclock signal (not shown). When a hash operation is completed on a blockof input data, the associated hash value is placed into the outputregisters 1209-1210. Execution of an XSTOR micro instruction causescontents of a designated output register 1209-1210 to be provided to astore bus (not shown).

Although the present invention and its objects, features, and advantageshave been described in detail, other embodiments are encompassed by theinvention as well. For example, the present invention has been discussedat length according to embodiments that are compatible with the x86architecture. However, the discussions have been provided in such amanner because the x86 architecture is widely comprehended and thusprovides a sufficient vehicle to teach the present invention. Thepresent invention nevertheless comprehends embodiments that comport withother instruction set architectures such as POWERPC®, MIPS®, and thelike, in addition to entirely new instruction set architectures.

The present invention moreover comprehends execution of hash operationswithin elements of a computing system other than the microprocessoritself. For example, the hash instruction according to the presentinvention could easily be applied within an embodiment of a hash unitthat is not part of the same integrated circuit as a microprocessor thatexercises as part of the computer system. It is anticipated that suchembodiments of the present invention are in order for incorporation intoa chipset surrounding a microprocessor or as a processor dedicated forperforming hash operations where the hash instruction is handed off tothe processor from a host microprocessor. It is contemplated that thepresent invention applies to embedded controllers, industrialcontrollers, signal processors, array processors, and any like devicesthat are employed to process data. The present invention alsocomprehends an embodiment comprising only those elements essential toperforming hash operations as described herein. A device embodied assuch would indeed provide a low-cost, low-power alternative forperforming hash operations only, say, as a hash processor within acommunications system. For clarity, the present inventors refer to thesealternative processing elements as noted above as processors.

Furthermore, although the secure hash algorithm has been prominentlyfeatured in this application, the present inventors note that theinvention described herein encompasses lesser known hash algorithms aswell such as are alluded to herein. What is sufficient to comprehend isthat the present invention provides dedicated hash apparatus andsupporting methodology within a microprocessor where atomic hashoperations can be invoked via execution of a single instruction.

Finally, although the present invention has been specifically discussedas a single hash unit that supports a prescribed hash algorithm, theinvention also comprehends provision of multiple hash units operativelycoupled in parallel with other execution units in a conformingmicroprocessor where each of the multiple hash units is configured toperform a specific hash algorithm. For example, a first unit isconfigured for SHA, a second for CBC-MAC, and so on.

Those skilled in the art should appreciate that they can readily use thedisclosed conception and specific embodiments as a basis for designingor modifying other structures for carrying out the same purposes of thepresent invention, and that various changes, substitutions andalterations can be made herein without departing from the spirit andscope of the invention as defined by the appended claims.

1. An apparatus, configured to perform a hash operation, the apparatuscomprising: an atomic hash instruction, disposed within amicroprocessor, configured to direct said microprocessor to perform thehash operation, wherein the hash operation is accomplished on one ormore message blocks, and wherein said microprocessor translates saidatomic hash instruction into first micro instructions and second microinstructions, said atomic hash instruction comprising: an opcode field,configured to prescribe that said microprocessor accomplish the hashoperation and indicate whether the hash operation has been interruptedby an interrupting event; and a hash mode field, coupled to said opcodefield, configured to prescribe that said microprocessor accomplish thehash operation according to a prescribed hash mode; wherein saidmicroprocessor comprises: an integer unit, configured to operate inparallel with a hash unit, wherein said hash unit executes said firstmicro instructions to perform a hash of one or more message blocks, andwherein said integer unit executes said second micro instructions totest a bit in a flags register, to update text pointer registers, and toprocess interrupts during execution of the hash operation.
 2. Theapparatus as recited in claim 1, wherein said bit indicates whether thehash operation has been interrupted by said interrupting event.
 3. Theapparatus as recited in claim 1, wherein said flags register comprisesan EFLAGS register within said x86-compatible microprocessor, andwherein said bit comprises bit 30 within said EFLAGS register.
 4. Theapparatus as recited in claim 1, wherein said interrupting eventcomprises a transfer of program control to a program flow configured toprocess said interrupting event, and wherein execution of the hashoperation on a current input message block is interrupted.
 5. Theapparatus as recited in claim 4, wherein, upon return of program controlto said atomic hash instruction, the hash operation is performed on saidcurrent input message block.
 6. The apparatus as recited in claim 1,wherein said hash unit comprises: block hash logic, configured toperform said plurality of hash computations on said each of said one ormore message blocks according to said prescribed hash mode to produce anintermediate hash value.
 7. The apparatus as recited in claim 1, whereinsaid interrupting event comprises an interrupt, an exception, a pagefault, or a task switch.
 8. An apparatus for performing a hashoperation, comprising: an x86-compatible microprocessor, configured toperform the hash operation, and configured to indicate whether the hashoperation has been interrupted by an interrupting event, wherein thehash operation is accomplished on one or more message blocks, saidx86-compatible microprocessor comprising: a translator, configured totranslate an atomic hash instruction into first micro instructions andsecond micro instructions, said atomic hash instruction comprising: anopcode field, configured to prescribe the hash operation; and a hashmode field, coupled to said opcode field, configured to prescribe thatsaid microprocessor accomplish the hash operation according to a one ofa plurality of hash modes; and an integer unit, configured to operate inparallel with a hash unit, wherein said hash unit executes said firstmicro instructions to perform a hash of said one or more message blocks,and wherein said integer unit executes said second micro instructions totest a bit in a flags register, to update text pointer registers, and toprocess interrupts during execution of the hash operation.
 9. Theapparatus as recited in claim 8, wherein said bit indicates whether saidone of the hash operations has been interrupted by said interruptingevent.
 10. The apparatus as recited in claim 8, wherein said flagsregister comprises an EFLAGS register within said x86-compatiblemicroprocessor, and wherein said bit comprises bit 30 within said EFLAGSregister.
 11. The apparatus as recited in claim 8, wherein saidinterrupting event comprises a transfer of program control to a programflow configured to process said interrupting event, and whereinexecution of the hash operation on a current input message block isinterrupted.
 12. The apparatus as recited in claim 11, wherein, uponreturn of program control to said atomic hash instruction, the hashoperation is performed on said current input message block.
 13. Theapparatus as recited in claim 8, wherein said hash unit comprises: blockhash logic, configured to perform a plurality of hash computations oneach of said one or more message blocks according to said one of aplurality of hash modes to produce an intermediate hash value.
 14. Theapparatus as recited in claim 8, wherein said interrupting eventcomprises an interrupt, an exception, a page fault, or a task switch.15. A method for performing a hash operation in a microprocessor, themethod comprising: providing an atomic hash instruction that directs themicroprocessor to perform a the hash operation and to indicate whetherthe hash operation has been interrupted by an interrupting event,wherein the atomic hash instruction comprises: an opcode field,configured to prescribe the hash operation; and a hash mode field,coupled to said opcode field, configured to prescribe that themicroprocessor accomplish the hash operation according to a one of aplurality of hash modes; translating the atomic hash instruction intofirst micro instructions and second micro instructions; via a hash unitdisposed within the microprocessor, first executing the first microinstructions to accomplish the hash operation according to the hashmode; and via an integer unit disposed within the microprocessor, secondexecuting the second micro instructions in parallel with said firstexecuting to test a bit in a flags register, to update text pointerregisters, and to process interrupts during execution of the hashoperation.
 16. The apparatus as recited in claim 15, wherein the bitindicates whether the hash operation has been interrupted by theinterrupting event.
 17. The apparatus as recited in claim 15, whereinthe flags register comprises an EFLAGS register within thex86-compatible microprocessor, and wherein the bit comprises bit 30within the EFLAGS register.
 18. The apparatus as recited in claim 15,wherein the interrupting event comprises a transfer of program controlto a program flow configured to process the interrupting event, andwherein execution of the hash operation on a current input message blockis interrupted.
 19. The apparatus as recited in claim 18, wherein, uponreturn of program control to the atomic hash instruction, the hashoperation is performed on the current input message block.
 20. Themethod as recited in claim 15, wherein the interrupting event comprisesan interrupt, an exception, a page fault, or a task switch.